P versus NP problem

Results: 202



#Item
21February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2009-02-04 17:20:26
22Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions

Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions

Add to Reading List

Source URL: cognitiveharmony.net

Language: English - Date: 2008-09-30 17:00:23
23UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m.

UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m.

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2015-01-21 19:48:42
24The Astrophysical Journal, 567:L97–L101, 2002 March 1 䉷 2002. The American Astronomical Society. All rights reserved. Printed in U.S.A. PROMINENCE MAGNETIC DIPS IN THREE-DIMENSIONAL SHEARED ARCADES G. Aulanier Observ

The Astrophysical Journal, 567:L97–L101, 2002 March 1 䉷 2002. The American Astronomical Society. All rights reserved. Printed in U.S.A. PROMINENCE MAGNETIC DIPS IN THREE-DIMENSIONAL SHEARED ARCADES G. Aulanier Observ

Add to Reading List

Source URL: www.lesia.obspm.fr

Language: English - Date: 2009-05-27 05:36:12
25Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2006-11-19 23:12:18
26Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1

Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1

Add to Reading List

Source URL: www.asiapacific-mathnews.com

Language: English - Date: 2014-02-27 03:55:07
27Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT

Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT

Add to Reading List

Source URL: web.mit.edu

Language: English - Date: 2013-06-23 10:21:36
28Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy

Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy

Add to Reading List

Source URL: www.ms.unimelb.edu.au

Language: English - Date: 2011-11-19 03:23:12
29On the Theory of Average Case Complexity  Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx

On the Theory of Average Case Complexity  Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:24:22
30−Summary of the Interim Report− Nonylphenol AugustNational Institute of Technology and Evaluation

−Summary of the Interim Report− Nonylphenol AugustNational Institute of Technology and Evaluation

Add to Reading List

Source URL: www.nite.go.jp

Language: English - Date: 2015-04-24 00:49:29